منابع مشابه
Online Bottleneck Matching
We consider the online bottleneck matching problem, where k serververtices lie in a metric space and k request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. The goal is to minimize the maximum distance between any request and its server. Because no algorithm can have a competitive ratio better thanO(k) for this problem, we use resource augmenta...
متن کاملThe Power of Rejection in Online Bottleneck Matching
We consider the online matching problem, where n server-vertices lie in a metric space and n request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. We focus on the egalitarian bottleneck objective, where the goal is to minimize the maximum distance between any request and its server. It has been demonstrated that while there are effective algori...
متن کاملBottleneck Segment Matching
Let R be a set of n red segments and B a set of n blue segments, we wish to find the minimum value d∗, such that there exists a perfect matching between R and B with bottleneck d∗, i.e., the maximum distance between a matched red-blue pair is d∗. We first solve the corresponding decision problem: Given R, B and a distance d > 0, find a maximum matching between R and B with bottleneck at most d....
متن کاملBottleneck Partial-Matching Voronoi Diagrams
Given two point sets in the plane, we study the minimization of the (lexiocographic) bottleneck distance between the smaller set and an equally-sized subset of the larger set under translations. We relate this problem to two Voronoi-type diagrams, which are of interest for related problems. Their complexity is shown to be polynomial in the sizes of the sets and algorithms for their construction...
متن کاملServe or skip: the power of rejection in online bottleneck matching
We consider the online matching problem, where n server-vertices lie in a metric space and n request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. We focus on the egalitarian bottleneck objective, where the goal is to minimize the maximum distance between any request and its server. It has been demonstrated that while there are effective algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2012
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-012-9581-9